RDFS(FA): A DL-ised Sub-language of RDFS
نویسندگان
چکیده
Description Logics (DLs), as a field of research, form a formal foundation of first-order semantic Web ontology languages, such as DAML+OIL and OWL. The Semantic Web will build on XML’s ability to define customized tagging schemes and RDF(S)’s flexible approach to representing data. RDF Schema (RDFS), however, has a non-standard metamodeling architecture, which makes some elements in the model have dual roles in the RDFS specification. As a result, the specification of its semantics requires a non-standard model theory, RDF MT. This leads to semantic problems when trying to layer DL-based and other conventional firstorder Web ontology languages on top of RDFS. In this paper we suggest layering Web ontology languages on top of RDFS(FA), a sub-language of RDFS, which is based on a (relatively) standard model-theoretic semantics. We will also compare this approach with the existing RDF Model Theory and show how their semantics relate to the semantics of OWL, a newly developed Web ontology language by W3C.
منابع مشابه
RDFS(FA) and RDF MT: Two Semantics for RDFS
RDF Schema (RDFS) has a non-standard metamodeling architecture, which makes some elements in the model have dual roles in the RDFS specification. As a result, this can be confusing and difficult to understand and, more importantly, the specification of its semantics requires a non-standard model theory. This leads to semantic problems when trying to layer conventional first order languages, lik...
متن کاملMetamodeling Architecture of Web Ontology Languages
Recent research has shown that RDF Schema, as a schema layer Semantic Web language, has a non-standard metamodeling architecture. As a result, it is difficult to understand and lacks clear semantics. This paperproposes RDFS(FA) (RDFS with Fixed metamodeling Architecture) and demonstrates how the problems of RDF Schema can be solved under RDFS(FA). Based on the fixed metamodeling architecture, a...
متن کاملAn Extension of SPARQL for RDFS
RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet consensus in the Semantic Web community on how to define a query language for RDFS. In this paper, we introduce a language for querying RDFS data. This language is obtained by extending SPARQL with nested regular expressions th...
متن کاملCompleteness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary
We prove that entailment for RDFS (RDF Schema) is decidable, NP-complete, and in P if the target graph does not contain blank nodes. We show that the standard set of entailment rules for RDFS is incomplete and that this can be corrected by allowing blank nodes in predicate position. We define semantic extensions of RDFS that involve datatypes and a subset of the OWL vocabulary that includes the...
متن کاملEfficient evaluation of SPARQL over RDFS graphs
Evaluating queries over RDFS is currently done by computing the closure, which is quadratic in the worst case. In this paper, we show how to evaluate SPARQL over RDFS graphs by using a navigational language grounded in standard relational algebra with operators for navigating triples with regular constraints. In particular, we show that there is a fragment of this language with linear time data...
متن کامل